Computing separable isogenies in quasi-optimal time
نویسندگان
چکیده
منابع مشابه
Computing Isogenies in F2n
Contrary to what happens over prime elds of large characteristic , the main cost when counting the number of points of an elliptic curve E over F2n is the computation of isogenies of prime degreè. The best method so far is due to Couveignes and needs asymptotically O(` 3) eld operations. We outline in this article some nice properties satissed by these isogenies and show how we can get from the...
متن کاملComputing Isogenies Between Abelian Varieties
We describe an efficient algorithm for the computation of isogenies between abelian varieties represented in the coordinate system provided by algebraic theta functions. We explain how to compute all the isogenies from an abelian variety whose kernel is isomorphic to a given abstract group. We also describe an analog of Vélu’s formulas to compute an isogeny with a prescribed kernel. All our alg...
متن کاملQuasi-isogenies and Morava stabilizer groups
For every prime p and integer n > 3 we explicitly construct an abelian variety A/Fpn of dimension n such that for a suitable prime l the group of quasi-isogenies of A/Fpn of l-power degree is canonically a dense subgroup of the n-th Morava stabilizer group at p. We also give a variant of this result taking into account a polarization. This is motivated by the recent construction of topological ...
متن کاملComputing Jacobi’s θ in quasi-linear time
Jacobi’s θ function has numerous applications in mathematics and computer science; a naive algorithm allows the computation of θ(z, τ), for z, τ verifying certain conditions, with precision P in O(M(P ) √ P ) bit operations, where M(P ) denotes the number of operations needed to multiply two complex P -bit numbers. We generalize an algorithm which computes specific values of the θ function (the...
متن کاملComputing Cubic Fields in Quasi-Linear Time
Cubic fields (over the rationals) are the simplest non-Galois number fields and thus should be the ideal testing ground for most general “density” conjectures, such as the Cohen-Martinet heuristics. We present an efficient algorithm to generate them, up to a given discriminant bound, which we hope will prove a useful tool in their computational exploration. It all originates from the seminal pa...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: LMS Journal of Computation and Mathematics
سال: 2015
ISSN: 1461-1570
DOI: 10.1112/s146115701400045x